Chromatic Prime Number for Circular Embedded Graph of the Tensor Product Graph
نویسندگان
چکیده
منابع مشابه
Circular Chromatic Number and Graph Minors
This paper proves that for any integer n ≥ 4 and any rational number r, 2 ≤ r ≤ n − 2, there exists a graph G which has circular chromatic number r and which does not contain Kn as a minor.
متن کاملThe Circular Chromatic Number of the Mycielski's Graph M
As a natural generalization of chromatic number of a graph, the circular chromatic number of graphs (or the star chromatic number) was introduced by A.Vince in 1988. Let M (G) denote the tth iterated Mycielski graph of G. It was conjectured by Chang, Huang and Zhu(Discrete mathematics,205(1999), 23-37) that for all n ≥ t+2, χc(M (Kn)) = χ(M (Kn)) = n+ t. In 2004, D.D.F. Liu proved the conjectur...
متن کاملThe Prime Number Graph
Let pn denote the nth prime. The prime number graph is the set of lattice points (n, pn), n = 1, 2.We show that for every k there are k such points that are collinear. By considering the convex hull of the prime number graph, we show that there are infinitely many n such that 2pn < pn_¡ + Pn+Ifor all positive i < n. By a similar argument, we show that there are infinitely many n for which pn > ...
متن کاملtotal dominator chromatic number of a graph
given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...
متن کاملThe set chromatic number of a graph
For a nontrivial connected graph G, let c : V (G) → N be a vertex coloring of G where adjacent vertices may be colored the same. For a vertex v of G, the neighborhood color set NC(v) is the set of colors of the neighbors of v. The coloring c is called a set coloring if NC(u) 6= NC(v) for every pair u, v of adjacent vertices of G. The minimum number of colors required of such a coloring is calle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Research in Applied Science and Engineering Technology
سال: 2017
ISSN: 2321-9653
DOI: 10.22214/ijraset.2017.4029